Socially Optimal Non-discriminatory Restrictions for Continuous-Action Games

We address the following mechanism design problem: Given a multi-player Normal-Form Game (NFG) with continuous action space, find non-discriminatory (i.e., identical for all players) restriction of space which maximizes resulting Nash Equilibrium respect to fixed social utility function. First, we propose formal model Restricted and corresponding optimization problem. then present an algorithm optimal restrictions under some assumptions. Our experimental results Braess' Paradox Cournot show that this method leads optimized Equilibria, even when assumptions are not guaranteed hold. Finally, outline generalization our approach much wider scope Stochastic Games.